1. Identity statement | |
Reference Type | Conference Paper (Conference Proceedings) |
Site | sibgrapi.sid.inpe.br |
Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
Identifier | 83LX3pFwXQZW44Lb/dkBhK |
Repository | dpi.inpe.br/ambro/1998/06.02.16.57 |
Last Update | 1998:06.16.03.00.00 (UTC) administrator |
Metadata Repository | sid.inpe.br/banon/2001/03.30.15.56.59 |
Metadata Last Update | 2022:05.18.22.23.10 (UTC) administrator |
Citation Key | Gonçalves:1997:NoReTr |
Title | Novos resultados em triangulações |
Year | 1997 |
Access Date | 2024, May 03 |
Number of Files | 1 |
Size | 75 KiB |
|
2. Context | |
Author | Gonçalves, Luiz Marcos Garcia |
Editor | Figueiredo, Luiz Henrique de Netto, Marcio Lobo |
Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI) |
Conference Location | Campos de Jordão, SP, Brazil |
Date | Oct. 1997 |
Publisher | Sociedade Brasileira de Computação |
Publisher City | Porto Alegre |
Book Title | Proceedings |
Organization | SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo |
History (UTC) | 2008-07-17 14:17:58 :: administrator -> banon :: 2008-08-26 15:26:29 :: banon -> administrator :: 2009-08-13 20:36:14 :: administrator -> banon :: 2010-08-28 20:04:53 :: banon -> administrator :: 2022-05-18 22:23:10 :: administrator -> :: 1997 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Keywords | greedy triangulation delaunay triangulation adaptive rectangular triangulation triangulation data structure |
Abstract | This paper describes a data structure with a restricted set of topological operations (creation, subdivision, and flip) used to construct planar triangulations. We discuss the implementation of algorithms to build some common triangulations (greedy, Delaunay, and rectangular adaptive) based on that structure. In order to allow the use of such a structure in the implementation of the Greedy Triangulation (GT), we define a new concept of GT and present an algorithm to build it. This GT algorithm has the same complexity as the best known algorithm for the traditional GT. |
Arrangement | urlib.net > SDLA > Fonds > SIBGRAPI 1997 > Novos resultados em... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
data URL | http://urlib.net/ibi/83LX3pFwXQZW44Lb/dkBhK |
zipped data URL | http://urlib.net/zip/83LX3pFwXQZW44Lb/dkBhK |
Target File | art58.pdf |
User Group | administrator |
Visibility | shown |
|
5. Allied materials | |
Next Higher Units | 8JMKD3MGPEW34M/46RL7SS |
Citing Item List | sid.inpe.br/sibgrapi/2022/05.08.23.46 6 |
Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
|
6. Notes | |
Notes | The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16. |
Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark tertiarytype type url versiontype volume |
|